mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-31 09:43:11 +08:00
43 lines
1.9 KiB
HTML
43 lines
1.9 KiB
HTML
<p>You have <code>k</code> bags. You are given a <strong>0-indexed</strong> integer array <code>weights</code> where <code>weights[i]</code> is the weight of the <code>i<sup>th</sup></code> marble. You are also given the integer <code>k.</code></p>
|
|
|
|
<p>Divide the marbles into the <code>k</code> bags according to the following rules:</p>
|
|
|
|
<ul>
|
|
<li>No bag is empty.</li>
|
|
<li>If the <code>i<sup>th</sup></code> marble and <code>j<sup>th</sup></code> marble are in a bag, then all marbles with an index between the <code>i<sup>th</sup></code> and <code>j<sup>th</sup></code> indices should also be in that same bag.</li>
|
|
<li>If a bag consists of all the marbles with an index from <code>i</code> to <code>j</code> inclusively, then the cost of the bag is <code>weights[i] + weights[j]</code>.</li>
|
|
</ul>
|
|
|
|
<p>The <strong>score</strong> after distributing the marbles is the sum of the costs of all the <code>k</code> bags.</p>
|
|
|
|
<p>Return <em>the <strong>difference</strong> between the <strong>maximum</strong> and <strong>minimum</strong> scores among marble distributions</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> weights = [1,3,5,1], k = 2
|
|
<strong>Output:</strong> 4
|
|
<strong>Explanation:</strong>
|
|
The distribution [1],[3,5,1] results in the minimal score of (1+1) + (3+1) = 6.
|
|
The distribution [1,3],[5,1], results in the maximal score of (1+3) + (5+1) = 10.
|
|
Thus, we return their difference 10 - 6 = 4.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> weights = [1, 3], k = 2
|
|
<strong>Output:</strong> 0
|
|
<strong>Explanation:</strong> The only distribution possible is [1],[3].
|
|
Since both the maximal and minimal score are the same, we return 0.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= k <= weights.length <= 10<sup>5</sup></code></li>
|
|
<li><code>1 <= weights[i] <= 10<sup>9</sup></code></li>
|
|
</ul>
|